Queues in Series in Light Traffic
نویسندگان
چکیده
منابع مشابه
Gaussian queues in light and heavy traffic
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. Let Q X ≡ {Q X (t) : t ≥ 0} denote a stationary buffer content process for a fluid queue fed by the centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments, X(0) = 0, continuous sample paths and variance function σ 2(·). The system is drained at a constant rate c > 0, so that for a...
متن کاملGaussian queues in the heavy/light-traffic regime
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments and variance function σ X(·), equipped with a deterministic drift c > 0, reflected at 0: Q (c) X (t) = sup −∞<s≤t (X(t)−X(s)− c(t− s)). We study the resulting stationary workload processQ (c...
متن کاملArranging Queues in Series
For given external arrival process and given service-time distributions, the object is to determine the order of infinite-capacity single-server queues in series that minimizes the long-run average sojourn time per customer. We gain additional insight into this queueing design problem, and congestion in open queueing networks more generally, primarily by performing simulation experiments. We de...
متن کاملBasic Limit Theorems for Light Traffic Queues & Their Applications
In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodology for applying these theorems for the benefit of service systems. The limit theorems studied here are dominant in the literature. Our contribution is primarily on the analysis le...
متن کاملLight-Traffic Analysis for Queues with Spatially Distributed Arrivals
We consider the following continuous polling system: Customers arrive according to a homogeneous Poisson process (or a more general stationary point process) and wait on a circle in order to be served by a single server. The server is “greedy”, in the sense that he always moves (with constant speed) towards the nearest customer. The customers are served according to an arbitrary service time di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1993
ISSN: 1050-5164
DOI: 10.1214/aoap/1177005370